Shortest Paths Routing in Arbitrary Networks

Shortest Paths Routing on Arbitrary Networks (k Urzeste-wege-routing in Beliebigen Netzwerken)

On the Representability of Arbitrary Path Sets as Shortest Paths: Theory, Algorithms, and Complexity

The question, whether an optional set of routes can be represented as shortest paths, and if yes, then how, has been a rather scarcely investigated problem up until now. In turn, an algorithm that, given an arbitrary set of traffic engineered paths, can efficiently compute OSPF link weights as to map the given paths to shortest paths may be of huge importance in today’s IP networks, which still...

Shortest-Path Routing in Arbitrary Networks

We introduce an on-line protocol which routes any set of N packets along shortest paths with congestion C and dilation D through an arbitrary network in O(C +D+log N) steps, with high probability. This time bound is optimal up to the additive log N , and it has previously only been reached for bounded-degree leveled networks. Further, we show that the above bound holds also for random routing p...

On the Space Requirement of Interval Routing

Interval routing is a space-efficient method for point-to-point networks. It is based on labeling the edges of a network with intervals of node numbers (called interval labels). AnM -label scheme allows up toM labels to be put on an edge. Intuitively, the largerM is, the better the quality of (i.e., shorter) the paths thus generated. For arbitrary graphs of size n, n the number of nodes, the pr...

More on the Efficiency of Interval Routing

Interval routing is a space-efficient routing method for computer networks. The method is said to be optimal if it can generate optimal routing paths for any source-destination node pair. A path is optimal if it is a shortest path between the two nodes involved. A seminal result (The Computer Journal, 34 (1991), 475–476) in the area, however, has pointed out that “the interval routing algorithm...